Adapting tableaux for classification
نویسندگان
چکیده
We present an approach for studying logical properties of problemsolving methods (PSMs) for knowledge-intensive tasks. It is based on semantic tableaux (a deduction-style theorem-proving technique). We show how tableaux can be manipulated in a methodical way to formalize non-deductive style PSMs.
منابع مشابه
Some Bijective Correspondences Involving Domino Tableaux
We elaborate on the results in [CaLe]. We give bijective proofs of a number of identities that were established there, in particular between the Yamanouchi domino tableaux and the Littlewood-Richardson tableaux that correspond to the same tensor product decomposition. 1991 Mathematics Subject Classification: 05E10.
متن کاملEdge Sequences, Ribbon Tableaux, and an Action of Affine Permutations
An overview is provided of some of the basic facts concerning rim hook lattices and ribbon tableaux, using a representation of partitions by their edge sequences. An action is defined of the affine Coxeter group of type Ãr−1 on the r-rim hook lattice, and thereby on the sets of standard and semistandard r-ribbon tableaux, and this action is related to the concept of chains in r-ribbon tableaux....
متن کاملExplaining Subsumption and Patching Non-Subsumption with Tableaux Methods
Explaining Subsumption and Unsatisfiability Our approach follows the idea of adapting a tableaux algorithm for explaining subsumption and unsatisfiability as suggested in [1, 4]. The explanation follows the proof and uses the structure of a tableaux tree for the production of natural-language explanations. Our method covers the DL SHIN including GCIs. We rely on a data structure for annotated t...
متن کاملSet theory and tableaux for teaching propositional logic
In this work we suggest the use of a set-theoretical interpretation of semantic tableaux for teaching propositional logic. If the student has previous notions of basic set theory, this approach to semantical tableaux can clarify her the way semantic trees operate, linking the syntactical and semantical sides of the process. Also, it may be useful for the introduction of more advanced topics in ...
متن کاملFlag Varieties and Interpretations of Young Tableau Algorithms
The conjugacy classes of nilpotent n × n matrices can be parametrised by partitions λ of n, and for a nilpotent η in the class parametrised by λ, the variety Fη of η-stable flags has its irreducible components parametrised by the standard Young tableaux of shape λ. We indicate how several algorithmic constructions defined for Young tableaux have significance in this context, thus extending Stei...
متن کامل